Clathrin Adaptor Complex-interacting Protein Irc6 Functions through the Conserved C-Terminal Domain.

Clathrin coats drive transport vesicle formation from the plasma membrane and in pathways between the trans-Golgi network (TGN) and endosomes. Clathrin adaptors play central roles orchestrating assembly of clathrin coats. The yeast clathrin adaptor-interacting protein Irc6 is an orthologue of human p34, which is mutated in the inherited skin disorder punctate palmoplantar keratoderma type I. Irc6 and p34 bind to clathrin adaptor complexes AP-1 and AP-2 and are members of a conserved family characterized by a two-domain architecture. Irc6 is required for AP-1-dependent transport between the TGN and endosomes in yeast. Here we present evidence that the C-terminal two amino acids of Irc6 are required for AP-1 binding and transport function. Additionally, like the C-terminal domain, the N-terminal domain when overexpressed partially restores AP-1-mediated transport in cells lacking full-length Irc6. These findings support a functional role for Irc6 binding to AP-1. Negative genetic interactions with irc6∆ are enriched for genes related to membrane traffic and nuclear processes, consistent with diverse cellular roles for Irc6

Recent advances in multistep solution nanosynthesis of nanostructured three-dimensional complexes of semiconductive materials

AbstractConstructing simply nanostructured zero-, one-, and two-dimensional crystallites into three-dimensional multifunctional assemblies and systems at low-cost is essential and highly challenging in materials science and engineering. Compared to the simply nanostructured components, a three-dimensional (3D) complex made with a precisely controlled spatial organization of all structural nanocomponents can enable us to concert functionalities from all the nanocomponents. Methodologically, so doing in nm-scales via a solution chemistry route may be much easier and less expensive than via other mechanisms. Hence, we discuss herein some recent advances in multistep solution syntheses of nanostructured 3D complexes of semiconductors with a focus mainly on their synthetic strategies and detailed mechanisms

Comparison the performance of both CuO and La2O3 as a metal oxide nanoparticles Catalyst in the carbonylation the Glycerol with Carbone Dioxide to produce Glycerol carbonate.

Two types of metal oxide nanoparticle catalysts Lanthanum oxide (La2O3) and Copper oxide (CuO) are prepared by new method which was quick precipitation (QPT) method at calcination temperature of 400oC for 4h and used for the synthesis of glycerol carbonate from the direct reaction by the carbonylation of Glycerol with Carbone Dioxide. The quick precipitation (QPT) was a new and important route for the preparation of nanoparticles catalyst and it was developed by strategy in this work. The effects of performance of (La2O3 and CuO) nanoparticle catalysts on the conversion of glycerol, yield of glycerol carbonate, selectivity of glycerol carbonate and Turnover frequency are researched. XRD, FT-IR and SEM are used for the characterization of the prepared metal oxide catalysts. It is found that the best metal oxide nanoparticles catalyst in GL carbonylation reaction is CuO prepared by quick precipitation (QPT) method at calcination temperature of 400oC for 4h. Under 150 oC, 4MPa ( 40 bar.), 5h, and CuO catalyst amount 37.6% (based on ratio of glycerol weight) by using 2-pyridinecarbonitrate (C6H4N2) as dehydrating agent and dimethylformamide (DMF) as solvent, the glycerol conversion, glycerol carbonate yield and selectivity are 48.64%, 38.88%, and 79.94%, respectively, and the turnover frequency (TOF) value of the catalyst can reach 0.2061h-1, and the catalysts could be easily regenerated by washing with methanol and water after a reaction and then dried at 60 oC overnight after that calcination at 400◦C for 4h without loss of activity after five recycling times. Keywords:  glycerol ; glycerol carbonate ; carbon dioxide ; metal oxide nanoparticle  catalyst ; CuO nanoparticle catalyst ; carbonylation ; La2O3; DMF

The CON Job scheduling problem on a single and parallel machines

We study job scheduling problems on both a single machine and on independent identical parallel machines. We impose a due date cost and each of the jobs have earliness and tardiness costs. The single machine problem considers that all the jobs are processed by only one machine. The goal is to find the optimal due date that minimizes the cost. The parallel machines problem considers m identical machines which process the jobs simultaneously. We consider several variations of the problem. These include the constant flow allowance problem, job independent and job dependent cost problems, and the slack due date problem. Our main contribution is a new algorithm for job dependent costs on parallel machines